On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem
نویسندگان
چکیده
منابع مشابه
A Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کاملLP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design
We study problems that integrate buy-at-bulk network design into the classical (connected) facility location problem. In such problems, we need to open facilities, build a routing network, and route every client demand to an open facility. Furthermore, capacities of the edges can be purchased in discrete units from K different cable types with costs that satisfy economies of scale. We extend th...
متن کاملApproximation Algorithms for Problems Combining Facility Location and Network Design
We present approximation algorithms for integrated logistics problems that combine elements of facility location and transport network design. We first study the problem where opening facilities incurs opening costs and transportation from the clients to the facilities incurs buy-at-bulk costs, and provide a combinatorial approximation algorithm. We also show that the integer programming formul...
متن کاملSingle-Sink Network Design with Vertex Connectivity Requirements
We study single-sink network design problems in undirected graphs with vertex connectivity requirements. The input to these problems is an edge-weighted undirected graph G = (V, E), a sink/root vertex r, a set of terminals T ⊆ V, and integer k. The goal is to connect each terminal t ∈ T to r via k vertex-disjoint paths. In the connectivity problem, the objective is to find a min-cost subgraph o...
متن کاملCost-Distance: Two Metric Network Design
We present the COST-DISTANCE problem: finding a Steiner tree which optimizes the sum of edge costs along one metric and the sum of source-sink distances along an unrelated second metric. We give the first known randomized approximation scheme for COST-DISTANCE, where is the number of sources. We reduce several common network design problems to COST-DISTANCE, obtaining (in some cases) the first ...
متن کامل